Recognition of quasi-Meyniel graphs
نویسندگان
چکیده
We present a polynomial-time algorithm for recognizing quasi-Meyniel graphs. A hole is a chordless cycle with at least four vertices. A cap is a cycle with at least 6ve vertices, with a single chord that forms a triangle with two edges of the cycle. A graph G is quasi-Meyniel if it contains no odd hole and for some x ∈ V (G), the chord of every cap in G has x as an endvertex. Our recognition algorithm is based on star cutset decompositions. ? 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Meyniel Weakly Triangulated Graphs - I: Co-perfect Orderability
We show that Meyniel weakly triangulated graphs are co-perfectly orderable (equivalently , that P 5-free weakly triangulated graphs are perfectly orderable). Our proof is algorithmic, and relies on a notion concerning separating sets, a property of weakly triangulated graphs, and several properties of Meyniel weakly triangulated graphs.
متن کاملPrecoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs....
متن کاملPrecoloring co-Meyniel graphs
The pre-coloring extension problem consists, given a graph G and a subset of nodes to which some colors are already assigned, in nding a coloring of G with the minimum number of colors which respects the pre-coloring assignment. This can be reduced to the usual coloring problem on a certain contracted graph. We prove that pre-coloring extension is polynomial for complements of Meyniel graphs. W...
متن کاملErratum : MCColor is not optimal on Meyniel graphs
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. In [2] we claimed that our algorithm MCColor produces an optimal coloring for every Meyniel graph. But later we found a mistake in the proof and a couterexample to the optimality, which we present here. MCColor can still be used to find a stable set that intersects all maximal cliques of a Meyniel graph ...
متن کاملOn Planar Quasi-Parity Graphs
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Hougardy conjectured that the minimal forbidden subgraphs for the class of SQP graphs are the odd chordless cycles, the complements of odd or even chordless cycles, and some line-graphs of bipartite graphs. Here we prove t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 113 شماره
صفحات -
تاریخ انتشار 2001